5 research outputs found
An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
In this paper, we consider the task of computing an independent set of
maximum weight in a given -claw free graph equipped with a
positive weight function . In doing so,
is considered a constant. The previously best known approximation algorithm for
this problem is the local improvement algorithm SquareImp proposed by Berman.
It achieves a performance ratio of in time
for any , which has remained
unimproved for the last twenty years. By considering a broader class of local
improvements, we obtain an approximation ratio of
for any at the cost of
an additional factor of in the running time. In
particular, our result implies a polynomial time -approximation
algorithm. Furthermore, the well-known reduction from the weighted -Set
Packing Problem to the Maximum Weight Independent Set Problem in -claw
free graphs provides a
-approximation algorithm for the
weighted -Set Packing Problem for any . This improves on the
previously best known approximation guarantee of
originating from the result of Berman.Comment: full version of the paper "An Improved Approximation Algorithm for
the Maximum Weight Independent Set Problem in d-Claw Free Graphs" published
in the proceedings of STACS 2021, 30 pages, 4 figure
The Pareto Cover Problem
We introduce the problem of finding a set B of k points in [0,1]? such that the expected cost of the cheapest point in B that dominates a random point from [0,1]? is minimized. We study the case where the coordinates of the random points are independently distributed and the cost function is linear. This problem arises naturally in various application areas where customers\u27 requests are satisfied based on predefined products, each corresponding to a subset of features. We show that the problem is NP-hard already for k = 2 when each coordinate is drawn from {0,1}, and obtain an FPTAS for general fixed k under mild assumptions on the distributions
Improved guarantees for the a priori TSP
We revisit the a priori TSP (with independent activation) and prove stronger
approximation guarantees than were previously known. In the a priori TSP, we
are given a metric space and an activation probability for each
customer . We ask for a TSP tour for that minimizes the
expected length after cutting short by skipping the inactive customers. All
known approximation algorithms select a nonempty subset of the customers
and construct a master route solution, consisting of a TSP tour for and two
edges connecting every customer to a nearest customer in
. We address the following questions. If we randomly sample the subset ,
what should be the sampling probabilities? How much worse than the optimum can
the best master route solution be? The answers to these questions (we provide
almost matching lower and upper bounds) lead to improved approximation
guarantees: less than 3.1 with randomized sampling, and less than 5.9 with a
deterministic polynomial-time algorithm.Comment: 39 pages, 6 figures, extended abstract to appear in the proceedings
of ISAAC 202
The --Set Packing problem and a -approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags
The weighted -Set Packing problem is defined as follows: As input, we are
given a collection of sets, each of cardinality at most and
equipped with a positive weight. The task is to find a disjoint sub-collection
of maximum total weight. Already the special case of unit weights is known to
be NP-hard, and the state-of-the-art are -approximations
by Cygan and F\"urer and Yu. In this paper, we study the --Set Packing
problem, a generalization of the unweighted -Set Packing problem, where our
set collection may contain sets of cardinality and weight , as well as
sets of cardinality and weight . Building upon the state-of-the-art
works in the unit weight setting, we manage to provide a
-approximation also for the more general --Set
Packing problem. We believe that this result can be a good starting point to
identify classes of weight functions to which the techniques used for unit
weights can be generalized. Using a reduction by Fernandes and Lintzmayer, our
result further implies a -approximation for the Maximum
Leaf Spanning Arborescence problem (MLSA) in rooted directed acyclic graphs,
improving on the previously known -approximation by Fernandes and
Lintzmayer. By exploiting additional structural properties of the instance
constructed in their reduction, we can further get the approximation guarantee
for the MLSA down to . The MLSA has applications in broadcasting
where a message needs to be transferred from a source node to all other nodes
along the arcs of an arborescence in a given network.Comment: 49 pages, 10 figure